/**
*      author: Y_Yao
*      created: 2025-04-02 10:44:56
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 9e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
int a[N];
int n,k;
int f[N][64+5];

void solve()
{
    cin >> n >> k;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        f[i][0] = a[i];
    }
    for(int j = 1;j <= 65;j++)
    {
        for(int i = 1;i <= n;i++)
        {
            f[i][j] = f[f[i][j-1]][j-1];
        }
    }
    int now = 1;
    int t = 0;
    while(k)
    {
        if(k % 2 != 0)
        {
            now = f[now][t];
        }
        k /= 2;
        t++;
    }
    cout << now << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    // cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}